c/c++ runner looping buffer#112
Merged
Merged
Conversation
graebm
reviewed
May 6, 2026
DmitriyMusatkin
approved these changes
May 12, 2026
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
crt-java appears to be benchmarking faster than the crt-c runner. Investigation shows that java is using a 8MiB buffer while native c is setting up one uber buffer the size of the file. Using a singular mega-buffer in crt-c was causing high CPU cache thrashing and accessing DRAM instead of utilizing faster CPU L3 cache.
This PR mirrors what Java is doing into the native C runner by setting up a fixed 8MiB buffer instead of a buffer sized to the largest upload file.
crt-c runner upload-max-throughput results:
With full file size buffer:
Gb/s mean: 147.25
Duration: 29.17
With 8MiB looping buffer:
Gb/s mean: 153.48
Duration: 27.99
crt-cpp runner was also updated as well.
By submitting this pull request, I confirm that you can use, modify, copy, and redistribute this contribution, under the terms of your choice.